Sparse geometric graphs with small dilationARONOV, Boris; DE BERG, Mark; CHEONG, Otfried et al.Lecture notes in computer science. 2005, pp 50-59, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 10 p.Conference Paper

Fast Maximal Cliques Enumeration in Sparse GraphsLIJUN CHANG; XU YU, Jeffrey; LU QIN et al.Algorithmica. 2013, Vol 66, Num 1, pp 173-186, issn 0178-4617, 14 p.Article

Designing a Good Low-Rate Sparse-Graph CodeANDRIYANOVA, Iryna; TILLICH, Jean-Pierre.IEEE transactions on communications. 2012, Vol 60, Num 11, pp 3181-3190, issn 0090-6778, 10 p.Article

Algorithms for the d-dimensional rigidity matroid of sparse graphsBEREG, Sergey.Lecture notes in computer science. 2005, pp 29-36, issn 0302-9743, isbn 3-540-30467-3, 1Vol, 8 p.Conference Paper

Maximum-size subgraphs of P4-sparse graphs admitting a perfect matchingNIKOLOPOULOS, Stavros D; PALIOS, Leonidas.Lecture notes in computer science. 2005, pp 68-79, issn 0302-9743, isbn 3-540-29673-5, 1Vol, 12 p.Conference Paper

Using composite low rank and sparse graph for label propagationJUNJUN GUO; DAIWEN WU.Electronics letters. 2014, Vol 50, Num 2, pp 84-86, issn 0013-5194, 3 p.Article

New algorithms for enumerating all maximal cliquesMAKINO, Kazuhisa; UNO, Takeaki.Lecture notes in computer science. 2004, pp 260-272, issn 0302-9743, isbn 3-540-22339-8, 13 p.Conference Paper

On the b-dominating coloring of graphsHOANG, C. T; KOUIDER, Mekkia.Discrete applied mathematics. 2005, Vol 152, Num 1-3, pp 176-186, issn 0166-218X, 11 p.Article

Minimal separators in P₄-sparse graphsNIKOLOPOULOS, Stavros D; PALIOS, Leonidas.Discrete mathematics. 2006, Vol 306, Num 3, pp 381-392, issn 0012-365X, 12 p.Article

Distribution-Free Connectivity Testing for Sparse GraphsHALEVY, Shirley; KUSHILEVITZ, Eyal.Algorithmica. 2008, Vol 51, Num 1, pp 24-48, issn 0178-4617, 25 p.Article

Graph mining for discovering infrastructure patterns in configuration management databasesANCHURI, Pranay; ZAKI, Mohammed J; BARKOL, Omer et al.Knowledge and information systems (Print). 2012, Vol 33, Num 3, pp 491-522, issn 0219-1377, 32 p.Article

An optimal parallel solution for the path cover problem on P₄-sparse graphsASDRE, Katerina; NIKOLOPOULOS, Stavros D; PAPADOPOULOS, Charis et al.Journal of parallel and distributed computing (Print). 2007, Vol 67, Num 1, pp 63-76, issn 0743-7315, 14 p.Article

Solving Diameter Constrained Minimum Spanning tree problems in dense graphsDOS SANTOS, Andréa C; LUCENA, Abilio; RIBEIRO, Celso C et al.Lecture notes in computer science. 2004, pp 458-467, issn 0302-9743, isbn 3-540-22067-4, 10 p.Conference Paper

On the recognition of probe graphs of some self-complementary classes of perfect graphsCHANG, Maw-Shang; KLOKS, Ton; KRATSCH, Dieter et al.Lecture notes in computer science. 2005, pp 808-817, issn 0302-9743, isbn 3-540-28061-8, 10 p.Conference Paper

Fully Dynamic Geometric SpannersRODITTY, L.Algorithmica. 2012, Vol 62, Num 3-4, pp 1073-1087, issn 0178-4617, 15 p.Article

Distributed computing on regular networks with anonymous nodesLAKSHMAN, T. V; WEI, V. K.IEEE transactions on computers. 1994, Vol 43, Num 2, pp 211-218, issn 0018-9340Article

On large induced trees and long induced paths in sparse random graphsSUEN, W. C. S.Journal of combinatorial theory. Series B. 1992, Vol 56, Num 2, pp 250-262, issn 0095-8956Article

Pebble game algorithms and sparse graphsLEE, Audrey; STREINU, Ileana.Discrete mathematics. 2008, Vol 308, Num 8, pp 1425-1437, issn 0012-365X, 13 p.Conference Paper

Experiments with the fixed-parameter approach for two-layer planarizationSUDERMAN, Matthew; WHITESIDES, Sue.Lecture notes in computer science. 2003, pp 345-356, issn 0302-9743, isbn 3-540-20831-3, 12 p.Conference Paper

A faster algorithm for finding maximum independent sets in sparse graphsFURER, Martin.Lecture notes in computer science. 2006, pp 491-501, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 11 p.Conference Paper

Spanners with slackCHAN, T.-H. Hubert; DINITZ, Michael; GUPTA, Anupam et al.Lecture notes in computer science. 2006, pp 196-207, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

An exact algorithm for MAX-CUT in sparse graphsCROCE, F. Della; KAMINSKI, M. J; PASCHOS, V. Th et al.Operations research letters. 2007, Vol 35, Num 3, pp 403-408, issn 0167-6377, 6 p.Article

On bipartite graphs with weak density of some subgraphsFOUQUET, Jean-Luc; VANHERPE, Jean-Marie.Discrete mathematics. 2007, Vol 307, Num 11-12, pp 1516-1524, issn 0012-365X, 9 p.Conference Paper

Improving the gilbert-varshamov bound for q-ary codesVAN VU; LEI WU.IEEE transactions on information theory. 2005, Vol 51, Num 9, pp 3200-3208, issn 0018-9448, 9 p.Article

Packet-centric approach to distributed sparse-graph coding in wireless ad hoc networksSTEFANOVIC, Cedomir; VUKOBRATOVIC, Dejan; STANKOVIC, Vladimir et al.Ad hoc networks. 2013, Vol 11, Num 1, pp 167-181, issn 1570-8705, 15 p.Article